Experiments with Improved Approximate Mean Value Analysis Algorithms
نویسندگان
چکیده
Approximate Mean Value Analysis (MVA) is a popular technique for analyzing queueing networks because of the efficiency and accuracy that it affords. In this paper, we present a new software package, called the Improved Approximate Mean Value Analysis Library (IAMVAL), which can be easily integrated into existing commercial and research queueing network analysis packages. The IAMVAL packages includes two new approximate MVA algorithms, the Queue Line (QL) algorithm and the Fraction Line (FL) algorithm, for analyzing multiple class separable queueing networks. The QL algorithm is always more accurate than, and yet has approximately the same computational efficiency as, the BardSchweitzer Proportional Estimation (PE) algorithm, which is currently the most widely used approximate MVA algorithm. The FL algorithm has the same computational cost and, in noncongested separable queueing networks where queue lengths are quite small, yields more accurate solutions than both the QL and PE algorithms.
منابع مشابه
Exact and approximate solutions of fuzzy LR linear systems: New algorithms using a least squares model and the ABS approach
We present a methodology for characterization and an approach for computing the solutions of fuzzy linear systems with LR fuzzy variables. As solutions, notions of exact and approximate solutions are considered. We transform the fuzzy linear system into a corresponding linear crisp system and a constrained least squares problem. If the corresponding crisp system is incompatible, then the fuzzy ...
متن کاملUnifying Value Iteration, Advantage Learning, and Dynamic Policy Programming
Approximate dynamic programming algorithms, such as approximate value iteration, have been successfully applied to many complex reinforcement learning tasks, and a better approximate dynamic programming algorithm is expected to further extend the applicability of reinforcement learning to various tasks. In this paper we propose a new, robust dynamic programming algorithm that unifies value iter...
متن کاملA Consistent and Accurate Numerical Method for Approximate Numerical Solution of Two Point Boundary Value Problems
In this article we have proposed an accurate finite difference method for approximate numerical solution of second order boundary value problem with Dirichlet boundary conditions. There are numerous numerical methods for solving these boundary value problems. Some these methods are more efficient and accurate than others with some advantages and disadvantages. The results in experiment on model...
متن کاملAn Algorithm for Approximate Factorization of Bivariate Polynomials
In this paper, we propose a new numerical method for factoring approximate bivariate polynomials over C. The method relies on Ruppert matrix and singular value decomposition. We also design a new reliable way to compute the approximate GCD of bivariate polynomials with floating-point coefficients. The algorithm has been implemented in Maple 9. The experiments show that the algorithms are very e...
متن کاملPeriodic Oscillations in the Analysis of Algorithms and Their Cancellations
A large number of results in analysis of algorithms contain fluctuations. A typical result might read “The expected number of . . . for large n behaves like log2 n + constant + delta(log2 n), where delta(x) is a periodic function of period one and mean zero.” Examples include various trie parameters, approximate counting, probabilistic counting, radix exchange sort, leader election, skip lists,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Perform. Eval.
دوره 39 شماره
صفحات -
تاریخ انتشار 1998